8007) Planner J. Nash

Surgeon-Major J. P. Nash

Semantically Guided Mega Proof Planner Semantically Guided Mega Proof Planner

Proof planning is an application of AI-planning in mathematical domains. The planning operators, called methods, encode proving steps. One of the strength of proof planning comes from the usage of mathematical knowledge that heuristically restricts the search space. Semantically guided proof planning takes a diierent perspective and uses semantic information as search control heuristics. In thi...

On the search of Nash equilibrium in (j,k)-voting systems

Josep Freixas Technical University of Catalonia In (j, k)-games each player chooses amongst j ordered options and there are k possible outcomes. In this paper, we consider the case where players are assumed to prefer some out-comes to others, and note that when k > 2 the players have an incentive to vote strategically. In doing so, we combine the theory of cooperative game theory with social ch...

J ul 2 00 5 The Nash - Equilibrium Requires Strong Cooperation

Contrary to the customary view that the celebrated Nash-equilibrium theorem in Game Theory is paradigmatic for non-cooperative games, it is shown that, in fact, it is essentially based on a particularly strong cooperation assumption. Furthermore, in practice, this cooperation assumption is simply unrealistic.

Beyond Nash Bargaining Theory: The Nash Set*

We extend Nash's bargaining theory to non-convex and coalitional problems. This paper investigates the implications of Nash-like axioms for bilateral problems and the properties of consistency and converse consistency over multilateral settings. The result is a characterization of the Nash set of NTU games, defined as the solution concept where each pair of players is splitting the gains from t...